Search Space Reduction for Determination of Earthquake Source Parameters Using PCA and k-Means Clustering
نویسندگان
چکیده
منابع مشابه
PCA-guided search for K-means
K-means is undoubtedly themostwidely used partitional clustering algorithm. Unfortunately, due to the nonconvexity of the model formulations, expectation-maximization (EM) type algorithms converge to different local optima with different initializations. Recent discoveries have identified that the global solution of K-means cluster centroids lies in the principal component analysis (PCA) subspa...
متن کاملDistributed PCA and k-Means Clustering
This paper proposes a distributed PCA algorithm, with the theoretical guarantee that any good approximation solution on the projected data for k-means clustering is also a good approximation on the original data, while the projected dimension required is independent of the original dimension. When combined with the distributed coreset-based clustering approach in [3], this leads to an algorithm...
متن کاملtechnical and legal parameters for determination of river boundary,( case study haraz river)
چکیده با توسعه شهر نشینی و دخل و تصرف غیر مجاز در حریم رودخانه ها خسارات زیادی به رودخانه و محیط زیست اطراف آن وارده می شود. در حال حاضر بر اساس آئین نامه اصلاح شده بستر و حریم رودخانه ها، حریم کمی رودخانه که بلافاصله پس از بستر قرار می گیرد از 1 تا20 متر از منتهی الیه طرفین بستر رودخانه تعیین، که مقدار دقیق آن در هر بازه از رودخانه مشخص نیست. در کشورهای دیگر روشهای متفاوتی من جمله: درصد ریسک...
15 صفحه اولK-Means Clustering using Tabu Search with Quantized Means
The Tabu Search (TS) metaheuristic has been proposed for K-Means clustering as an alternative to Lloyd’s algorithm, which for all its ease of implementation and fast runtime, has the major drawback of being trapped at local optima. While the TS approach can yield superior performance, it involves a high computational complexity. Moreover, the difficulty in parameter selection in the existing TS...
متن کاملRandomized Dimensionality Reduction for k-Means Clustering
We study the topic of dimensionality reduction for k-means clustering. Dimensionality reduction encompasses the union of two approaches: 1) feature selection and 2) feature extraction. A feature selection-based algorithm for k-means clustering selects a small subset of the input features and then applies k-means clustering on the selected features. A feature extraction-based algorithm for k-mea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Sensors
سال: 2020
ISSN: 1687-725X,1687-7268
DOI: 10.1155/2020/8826634